import java.util.Scanner;

// HJ53 杨辉三角的变形
public class HJ53 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            int num = sc.nextInt();
            int arr[][] = new int[num][];
            System.out.println(arr);
            for (int i = 1; i < num; i++) {
                arr[i] = new int[i + 1];
                arr[0][0] = 1;
                for (int j = 0; j < i + 1; j++) {
                    arr[i][j] = arr[i - 1][j] + arr[i - 1][j + 1] * 2;
                    if (j == num && arr[i][j] % 2 == 0) {
                        System.out.println(num - j + 1);
                    }
                }
            }
        }
    }
}
